The Complexity of Generalized Satisfiability for Linear Temporal Logic
نویسندگان
چکیده
منابع مشابه
The Complexity of Generalized Satisfiability for Linear Temporal Logic
In a seminal paper from 1985, Sistla and Clarke showed that satisfiability for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the set of temporal operators used. If, in contrast, the set of propositional operators is restricted, the complexity may decrease. This paper undertakes a systematic study of satisfiability for LTL formulae over restricted sets of pro...
متن کاملThe Computational Complexity of Satisfiability of Temporal Horn Formulas in Propositional Linear-Time Temporal Logic
Since the invention of Prolog, a programming language based on classical first-order logic, many people have tried to extend it using similiar ideas and redefine the semantics of the extended Prolog in terms of nonclassical logics [3,5,81. The success of a programming language based on nonclassical logics usually lies in the new definiton of Horn formulas and SLD-resolution-like inference rule....
متن کاملAbstract Satisfiability of Linear Temporal Logic
Satisfiability of Linear Temporal Logic Maŕıa del Mar Gallardo, Pedro Merino, Ernesto Pimentel Dpto. de Lenguajes y Ciencias de la Computacion University of Malaga, 29071 Malaga, Spain {gallardo,pedro,ernesto}@lcc.uma.es Abstract. Model Checking has become one of the most powerful methModel Checking has become one of the most powerful methods for automatic verification of software systems. But ...
متن کاملGeneralized satisfiability for the description logic ALC
The standard reasoning problem, concept satisfiability, in the basic description logic ALC is PSpace-complete, and it is ExpTime-complete in the presence of general concept inclusions. Several fragments of ALC, notably logics in the FL, EL, and DL-Lite families, have an easier satisfiability problem; for some of these logics, satisfiability can be decided in polynomial time. We classify the com...
متن کاملBoolean Abstraction for Temporal Logic Satisfiability
Increasing interest towards property based design calls for effective satisfiability procedures for expressive temporal logics, e.g. the IEEE standard Property Specification Language (PSL). In this paper, we propose a new approach to the satisfiability of PSL formulae; we follow recent approaches to decision procedures for Satisfiability Modulo Theory, typically applied to fragments of First Or...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Logical Methods in Computer Science
سال: 2009
ISSN: 1860-5974
DOI: 10.2168/lmcs-5(1:1)2009